Assuming 0 ♯ does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself.

We present two different types of models where, for certain singular cardinals λ of uncountable cofinality, λ → (λ,ω + 1) 2 , although λ is not a strong limit cardinal. We announce, here, and will present in a subsequent paper, [7], that, for example, consistently, $\aleph_{\omega_1} \nrightarrow (\aleph_{\omega_1}, \omega + 1)^2$ and consistently, 2 $^{\aleph_0} \nrightarrow (2^{\aleph_0},\omega + 1)^2$.

A fairly quotable special, but still representative, case of our main result is that for 2 ≤ n ≤ ω, there is a natural number m (n) such that, the following holds. Assume GCH: If $\lambda are regular, there is a cofinality preserving forcing extension in which 2 λ = μ and, for all $\sigma such that η +m(n)-1) ≤ μ, ((η +m(n)-1) ) σ ) → ((κ) σ ) η (1)n . This generalizes results of [3], Section 1, and (...) the forcing is a "many cardinals" version of the forcing there. (shrink)

We lay the combinatorial foundations for [5] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.